/*
 * @lc app=leetcode.cn id=1 lang=cpp
 *
 * [1] 两数之和
 */

// @lc code=start
class Solution
{
public:
    vector<int> twoSum(vector<int> &nums, int target)
    {
        //最经典的两数之和 两个数不能相同
        unordered_map<int, int> num;
        for (int i = 0; i < nums.size(); i++)
        {
            num.emplace(pair<int, int>(nums[i], i));
        }
        for (int i = 0; i < num.size(); i++)
        {
            if (num.find(target - nums[i]) != num.end())
            {
                if()
                return {i, num[target - nums[i]]};
            }
        }
        return {};
    }
};
// @lc code=end
